Wireless receiver using noise levels for combining signals having spatial diversity

ABSTRACT

A wireless receiver for receiving an incoming signal having spatial and temporal diversity. The receiver uses noise-based prescaling of multiple receiver chain signals for optimally combining the receiver chain signals in a composite equalized signal and uses noise-based time-varying postscaling the equalized signal. The receiver determines noise-based scale factors by comparing signal symbols to dispersed replica symbols of a training sequence for the incoming signal.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The invention relates generally to diversity and more particularly to wireless receivers using noise levels for combining multiple signals, using noise levels for dynamic scaling of an equalized signal, and having a method for determining noise levels.

[0003] 2. Description of the Prior Art

[0004] There is an escalating demand for wireless systems such as cellular telephones and wireless local area networks (LAN)s. This demand and economic factors are driving requirements for ever higher data throughput and greater range for these systems. However, as data rate and range is increased the wireless signals in these systems are increasingly degraded by burst noise and by time-varying frequency selective attenuation (fading) and delay distortion. This fading and distortion, generally caused by having multiple signal paths or channels between a transmitter and receiver, is known as multipath fading or multipath distortion or simply multipath.

[0005] A technique called equalization is commonly used for compensating for the effects of the multipath in order to estimate the bits that were actually transmitted. Most modem systems also use error detection and correction encoding where the transmitter encodes the bits that are transmitted with extra information that enables the receiver to use a decoding algorithm to detect and correct errors in the received bits after equalization.

[0006] Recent systems have improved upon standard or hard bit decision equalization with soft equalization where probabilities of transmitted bits are estimated. Where soft equalization is used, the receiver decoding algorithm operates on the probabilities of the equalized transmitted bits for error detection and correction.

[0007] In addition to equalization and encoding, wireless systems sometimes use other techniques, such as temporal diversity and spatial diversity, for combating burst noise and multipath. For temporal diversity, transmitted bits are interleaved into time-separated packets at a transmitter, spreading and thereby reducing the effect of burst noise or multipath fading in particular packets. The interleaved bits are then deinterleaved at the receiver to recreate their original order. However, in known systems where soft equalization is used, the reliability of the error detection and correction decoding process in the receiver is limited by changes in noise and multipath during the time separation.

[0008] Multiple antennas are used for spatial diversity for transmitting or receiving the wireless signals. Because the multiple antennas have different spatial locations, the signal paths are different and therefore the multipath is different. The multiple signals are combined at the receiver. A wireless receiver can use the idea that the multipath is different in the different signal paths in order to reduce the degradation that the multipath causes. Several combining methods, such as maximal ratio combining and equal gain combining are known in the prior art. However, none of the known methods combine the signals in an optimum way in the presence of equalization.

[0009] There remains a need for improved methods using spatial diversity and temporal diversity with equalization for reducing multipath effects.

SUMMARY OF THE INVENTION

[0010] It is therefore an object of the present invention to provide a spatial diversity receiver and method where multiple signals are weighted and combined according to their noise levels for providing an optimal composite equalized signal.

[0011] Another object of the present invention is to provide a temporal diversity receiver and method using noise scaling of a soft equalized signal before the signal is deinterleaved.

[0012] Another object of the present invention is to provide a simple apparatus and convenient method for determining a representation of signal noise level.

[0013] Briefly, a method and a receiver of the present invention determines ratios of noise levels of received signals and then uses the noise level ratios for determining noise-based scale factors. For spatial diversity, the noise-based scale factors are used for weighting multiple received signals inversely according to their respective noise levels for providing a composite equalized signal. For temporal diversity, the noise-based scale factors are used for dynamically scaling an equalized signal in order to compensate for time variations in noise and multipath. For temporal diversity and spatial diversity used together, the equalized signal that is scaled is the composite equalized signal.

[0014] In a preferred embodiment, for spatial diversity a receiver of the present invention includes multiple receiver chains and a noise-based spatial diversity combiner. For temporal diversity a receiver of the present invention includes a noise postscaler. For combined spatial and temporal diversity, the receiver includes the multiple receiver chains, the spatial diversity combiner, and the noise postscaler.

[0015] For spatial diversity, the receiver chains receive an incoming signal and provide sampled receiver chain signals to the spatial diversity combiner. The spatial diversity combiner scales and equalizes the sampled receiver chain signals by computing a set of composite equalizer branch metrics t_(n)(s→s′) as shown in an equation 1 and then uses the composite equalizer branch metrics t_(n)(s→s′) for providing a composite equalized signal u_(i) as shown in an equation 2. $\begin{matrix} {{t_{n}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{b}^{2}}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{m}^{2}}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}} & (1) \end{matrix}$

 u _(i) =F({{t _(n)(s→s′)},s,s′} _(n=0) ^(N−1))  (2)

[0016] In the equation 1, the n is the time index of the received symbols, the r_(n,a), r_(n,b) through r_(n,m) represent nth symbols received in receiver chains denoted “a”, “b” through “m”, respectively; the h_(k,a), h_(k,b) through h_(k,m) represent kth of 0 to K coefficients of channel impulse response sets for the “a”, “b” through “m” receiver chains, respectively; the x_(n)(s→s′) represents a symbol uniquely determined by an equalizer transition from an originating state s to a new state s′ for the nth symbol; the x_(n−k)(s) represents symbols uniquely determined by the state s for the nth symbol and the kth of said of 1 to K coefficients; the p_(a) ², p_(b) ² through p_(m) ² are quantities that represent the noise variances in the “a”, “b” through “m” receiver chains, respectively; and the t_(n)(s→s′) represents composite equalizer branch metrics corresponding to the equalizer transitions for the nth received symbols. The K most recent symbols {x_(n−k)(s)}_(k=1) ^(K) are uniquely determined by the originating state s. The 1/p_(a), 1/p_(b) through 1/p_(m) or their squares are noise-based scale factors.

[0017] There are S=P^(K+1) state s to state s′ equalizer transitions for each index n where “P” is the number of modulation states in the transmitted signal and “K+1” is the length or number of coefficients in the channel impulse response. For example for BPSK, “P” is two. For a P of two and a K of five, the number S of equalizer branch metrics t_(n)(s→s′) is 64 for each index n.

[0018] In the equation 2, the composite equalized signal u_(i) is the ith index for a function of all equalizer branch metrics. The composite equalized signal u_(i) has the form of a sample stream of bit probabilities for the i=0 . . . (N−1)th received symbol where N is the total number of received symbols over which the equalizer operates. This is the “soft” information that feeds an error correcting decoder.

[0019] The present invention can be implemented by noise scaling each of the composite equalizer branch metrics t_(n)(s=s′) as shown in equation 1, as it is being computed within an equalizer. However, this would require several multiplications per index n, the number of multiplications dependent on the total number of state transitions within the equalizer trellis (64 in the example above). In a preferred embodiment, the spatial diversity combiner therefore includes noise prescalers for prescaling the receiver chain signals r_(n,a), r_(n,b) through r_(n,m) and channel impulse response sets h_(k,a), h_(k,b) through h_(k,m) according to equations 3A-C and 4A-C.

{tilde over (r)} _(n,a)=(p _(min) /p _(a))r _(n,a)  (3A)

{tilde over (r)} _(n,b)=(p _(min) /p _(b))r _(n,b)  (3B)

{tilde over (r)} _(n,m)=(p _(min) /p _(m))r _(n,m)  (3C)

{tilde over (h)} _(k,a)=(p _(min) /p _(a))h _(k,a)  (4A)

{tilde over (h)} _(k,b)=(p _(min) /p _(b))h _(k,b)  (4B)

{tilde over (h)} _(k,m)=(p _(min) /p _(m))h _(k,m)  (4C)

[0020] In the equations 3A-C and 4A-C, the p_(min)=min(p_(a), p_(b) . . . p_(m)) where p_(min) is the smallest of the pa and p_(b) through p_(m); the {tilde over (r)}_(n,a), {tilde over (r)}_(n,b) through {tilde over (r)}_(n,m) represent prescaled receiver chain signals; and the {tilde over (h)}_(k,a), {tilde over (h)}_(k,b) through {tilde over (h)}_(k,m) represent the prescaled channel impulse response sets. The p_(min)/p_(a), p_(min)/p_(b) through p_(min)/p_(m) are noise-based scale factors. An equation 5 shows composite equalizer branch metrics {tilde over (t)}_(n)(s→s′) determined from the prescaled receiver chain signals {tilde over (r)}_(n,a), {tilde over (r)}_(n,b) through {tilde over (r)}_(n,m) and the prescaled channel impulse response sets {tilde over (h)}_(k,a), {tilde over (h)}_(k,b) through {tilde over (h)}_(k,m). $\begin{matrix} {{{\overset{\sim}{t}}_{n}\left( {s->s^{\prime}} \right)} = {{{{\overset{\sim}{r}}_{n,a} - {{\overset{\sim}{h}}_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,a}{x_{n - k}(s)}}}}}^{2} + {{{{\overset{\sim}{r}}_{n,b} - {{\overset{\sim}{h}}_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {{{\overset{\sim}{r}}_{n,m} - {{\overset{\sim}{h}}_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,m}{x_{n - k}(s)}}}}}^{2}}} & (5) \end{matrix}$

[0021] Because it is the ratio of the scale factors and not their actual values that is necessary for the optimal combining of the receiver chain signals, the p_(min) in the numerator of the scale factors can be replaced by an arbitrary constant. However, an advantage of the use of the p_(min) is that the signal level after automatic gain control (AGC) of the dominant receiver chain signal is retained while the signal levels of the other receiver chains are lowered, thereby retaining the use of the dynamic range of the equalizer. An equation 6 shows a composite equalized signal ũ_(i) of a sample stream of bit probabilities that is analogous to the composite equalized signal u_(i) of the equation 2.

ũ _(i) =F({{{tilde over (t)} _(n)(s→s′)},s,s′} _(n=0) ^(N−1))  (6)

[0022] In a system using temporal diversity, the noise postscaler dynamically scales packets of the composite equalized signal ũ_(i) by 1/p_(min) ² in order to eliminate the effect of packet-to-packet changes in noise level.

[0023] It should be noted that the composite equalizer branch metrics {tilde over (t)}_(n)(s→s′) scaled by 1/p_(min) ² are equal to the composite equalizer branch metrics t_(n)(s→s′) shown in the equation 1 and that the composite equalized signal ũ_(i) times 1/p_(min) ² is the composite equalized signal u_(i). However, the prescaling and postscaling of the present invention have substantially reduced the number of multiplications that are required.

[0024] For an alternative embodiment the equation 1 may be reformatted as shown in an equation 7. $\begin{matrix} {{{\overset{\sim}{t}}_{n}^{''}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{a}} \right)}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{b}} \right)}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{m}} \right)}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}} & (7) \end{matrix}$

[0025] In the equation 7 the product(p_({overscore (a)}) ²) is the product of all the noise representations p_(a) ², p_(b) ² through p_(m) ² except the noise representation p_(a) ²; the product(p_({overscore (b)}) ²) is the product of all the noise representations p_(a) ², p_(b) ² through p_(m) ² except the noise representation p_(b) ²; the product(p_({overscore (m)}) ²) is the product of all the noise representations p_(a) ², p_(b) ² through p_(m) ², except the noise representation p_(m) ²; and the {tilde over (t)}_(n)″(s→s′) represents the equalizer branch metrics corresponding to the trellis transition from state s to state s′, for the nth index. The product(p_({overscore (a)}))/p_(a)p_(b) . . . p_(m), product(p_({overscore (b)}))/p_(a)p_(b) . . . p_(m) through product(p_({overscore (m)}))/p_(a)p_(b) . . . p_(m) or their squares are noise-based scale factors. For only two receiver chains “a” and “b”, the product(p^({overscore (a)}) ²) is p_(b) ² and the product(p_({overscore (b)}) ²) is p_(a) ². For this alternative embodiment, the spatial diversity combiner includes noise prescalers for implementing equations 8A-C, 9A-C and 10 for determining composite equalizer branch metrics {tilde over (t)}_(n)″(s→s′) for the spatial diversity combiner with the prescaling for the receiver chains “a”, “b” through “m”.

{tilde over (r)}″ _(n,a)=product(p _({overscore (a)}) /p _(max))r _(n,a)  (8A)

{tilde over (r)}″ _(n,b)=product(p _({overscore (b)}) /p _(max))r _(n,b)  (8B)

{tilde over (r)}″ _(n,m)=product(p _({overscore (m)}) /p _(max))r _(n,m)  (8B)

{tilde over (h)}″ _(k,a)=product(p _({overscore (a)}) /p _(max))h _(k,a)  (9A)

{tilde over (h)}″ _(k,b)=product(p _({overscore (b)}) /p _(max))h _(k,b)  (9B)

{tilde over (h)}″ _(k,m)=product(p _({overscore (m)}) /p _(max))h _(k,m)  (9B)

[0026] $\begin{matrix} {{{\overset{\sim}{t}}_{n}^{''}\left( {s->s^{\prime}} \right)} = {{{{\overset{\sim}{r}}_{n,a}^{''} - {{\overset{\sim}{h}}_{o,a}^{''}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,a}^{''}{x_{n - k}(s)}}}}}^{2} + {{{{\overset{\sim}{r}}_{n,b}^{''} - {{\overset{\sim}{h}}_{o,b}^{''}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,b}^{''}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {{{\overset{\sim}{r}}_{n,m}^{''} - {{\overset{\sim}{h}}_{o,m}^{''}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{{\overset{\sim}{h}}_{k,m}^{''}{x_{n - k}(s)}}}}}^{2}}} & (10) \end{matrix}$

[0027] In the equations 8A-C and 9A-C, the p_(max)=max(p_(a), p_(b) . . . p_(m)) where p_(max) is the largest of the noise representations p_(a) and p_(b) through p_(m); the {tilde over (r)}″_(n,a), {tilde over (r)}″_(n,b) through {tilde over (r)}″_(n,m) represent prescaled receiver chain signals; the {tilde over (h)}″_(k,a), {tilde over (h)}″_(k,b) through {tilde over (h)}″_(k,m) represent the prescaled channel impulse response sets; and the {tilde over (t)}_(n)″(s→s′) represents composite equalizer branch metrics for the receiver chain signals {tilde over (r)}″_(n,a), {tilde over (r)}″_(n,b) through {tilde over (r)}″_(n,m) and the channel impulse response sets {tilde over (h)}″_(k,a), {tilde over (h)}″_(k,b) through {tilde over (h)}″_(k,m). The product(p_({overscore (a)})/p_(max)) is the product of the noise representations for all the receiver chains except the receiver chain “a” divided by the largest noise representation, the product(p_({overscore (b)})/p_(max)) is the product of the noise representations for all the receiver chains except for the receiver chain “b” divided by the largest noise representation, product(p_({overscore (m)})/p_(max)) is the product of the noise representations for all the receiver chains except for the receiver chain “m” divided by the largest noise representation. The product(p_({overscore (a)})/p_(max)), product(p_({overscore (b)})/p_(max)) through product(p_({overscore (m)})/p_(max)) are noise-based the scale factors. For only two receiver chains “a” and “b”, the product(p_({overscore (a)})/p_(max)) is p_(b)/p_(max) and the product(p_({overscore (b)})/p_(max)) is p_(a)/p_(max). For three receiver chains “a”, “b” and “c”, (the product(p_({overscore (a)})/p_(max)) is p_(b)p_(c)/p_(max) ² the product(p_({overscore (b)})/p_(max)) is p_(a)p_(c)/p_(max) ² and the product(p_({overscore (c)})/p_(max)) is p_(a)p_(b)/p_(max) ². Because it is the ratio of the scale factors and not their actual values that is necessary for the optimal combining the receiver chains, the p_(max) in the denominator of the scale factors may be replaced by an arbitrary constant. However, an advantage of the use of the p_(max) is that the signal level after automatic gain control (AGC) of the dominant receiver chain signal is retained while the signal levels of the other receiver chains are lowered, thereby retaining the use of the dynamic range of the equalizer.

[0028] In a system using temporal diversity, the noise postscaler in the alternative embodiment scales the composite equalizer branch metrics {tilde over (t)}_(n″)(s→s′) by a postscale factor of p_(max) ^(2(M−1))/p_(a) ²p_(b) ² . . . p_(m) ² in order to eliminate packet to packet changes in noise level where the M is the total number of receiver chains and the p_(a) ²p_(b) ² . . . p_(m) ² is the product of the quantities that represent the noise variances of all the receiver chains “a”, “b” through “m”. For only two receiver chains “a” and “b” the postscale factor is p_(max) ²/p_(a) ²p_(b) ². It should be noted that the composite equalizer branch metrics {tilde over (t)}_(n)″(s→s′) scaled by p_(max) ²/p_(a) ²p_(b) ² are equal to the composite equalizer branch metrics t_(n)(s→s′) shown in the equation 1. Hence the two systems provide the same results.

[0029] In a system using spatial diversity but not temporal diversity, the postscaler is not required. In a system using temporal diversity but not spatial diversity, only one receiver chain, denoted by “a”, is needed and the spatial diversity combiner is an equalizer for equalizing the receiver chain signal r_(n,a) with the channel impulse response set h_(k,a) without the need for noise-based prescaling. For a receiver with only the single receiver chain “a”, the postscaler uses a scale factor of 1/p_(a) ² for scaling the equalized signal in each data packet.

[0030] The true noise variances for the receiver chain signals r_(n,a), r_(n,b) through r_(n,m) can be computed and used for the quantities p_(a) ², p_(b) ² through p_(m) ², respectively. However, the calculation of such noise variances requires the computationally intensive operations of squaring real and imaginary noise components and then taking a square root of the squared real and imaginary components to compute the prescale factors required for the equations in 3A-C and 4A-C or 8A-C and 9A-C. The noise estimators of the present invention avoid the squaring and square root operations by using real and imaginary cyclic finite impulse response (FIR) filters for determining real and imaginary noises by comparing the symbols of the receiver chain signals r_(n,a), r_(n,b) through r_(n,m) to a known preamble as dispersed according to the calculated channel impulse response coefficients. The noise estimators then simply add the real and imaginary noises for determining the noise representations p_(a), p_(b) through p_(m). An equation 11 shows the determination of the noise representation p_(a) for the receiver chain “a”. The noise representations p_(b) through p_(m) are calculated in an identical manner for a receiver having multiple receiver chains “b” through “m”. $\begin{matrix} {p_{a} = {{\langle{{{Re}\quad \left\{ {r_{{n + \xi},a} - {\sum\limits_{k = 0}^{K}{h_{k,a}w_{n - k}}}} \right\}}}\rangle} + {\langle{{{Im}\quad \left\{ {r_{{n + \xi},a} - {\sum\limits_{k = 0}^{K}{h_{k,a}w_{n - k}}}} \right\}}}\rangle}}} & (11) \end{matrix}$

[0031] In the equation 11, the w_(n−k) represents the symbols corresponding to a known training sequence in the incoming signal, the ξ is the time index offset of the first received symbol corresponding to the training sequence received in the receiver chain “a”, and the outer brackets “<>” denote averaging. It should be noted that the method of the present invention takes advantage of the fact that the noise on the incoming signal is approximately uncorrelated between real and imaginary and both the real and imaginary noises have approximately a Gaussian distribution.

[0032] In a preferred embodiment for a Global System for Mobile Communication (GSM) system, the cyclic FIR filters take advantage of the fact that a 26 bit preamble includes a pre-pended 5 bits that duplicate the last 5 bits of a 16 bit mid-section and a post-pended 5 bits that duplicate the first 5 bits of the 16 bits of the mid-section for operating in a circular manner.

[0033] These and other objects and advantages of the present invention will no doubt become obvious to those of ordinary skill in the art after having read this summary and the following detailed description of the preferred embodiments which are illustrated in the various figures.

IN THE DRAWINGS

[0034]FIG. 1 is a block diagram of a receiver of the present invention for determining a noise representation and then using the noise representation for combining signals having temporal and spatial diversity;

[0035]FIG. 2 is a diagram of a system showing multiple signals channels with multiple antennas in the receiver of the present invention;

[0036]FIG. 3 is another block diagram of the receiver of FIG. 1;

[0037]FIG. 4 is a block diagram of a noise estimator of the receiver of FIG. 1;

[0038]FIG. 5 is a flow chart of a method for determining a noise representation and then using the noise representation for combining signals having temporal and spatial diversity of the receiver of FIG. 1;

[0039]FIG. 6 is a flow chart for combining signals in the method of FIG. 5; and

[0040]FIG. 7 is a flow chart for determining the noise representation in the method of FIG. 5.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0041]FIG. 1 is a block diagram of a preferred embodiment of a receiver of the present invention referred to by a general reference number 10. The receiver 10 includes a receiver chain 12A for processing signals received in an antenna A_(a), denoted by 14A, and a receiver chain 12B for processing signals received by an antenna A_(b), denoted by 14B. Although the receiver 10 is illustrated and described for two channels, the idea may extended to any number of channels.

[0042] The receiver chain 12A includes analog circuits G_(a), denoted by 24A; an analog-to-digital converter A/D_(a), denoted by 26A; and digital circuits g_(a); denoted by 28A. Similarly, the receiver chain 12B includes analog circuits G_(b), denoted by 24B; an analog-to-digital converter A/D_(b), denoted by 26B; and digital circuits g_(b), denoted by 28B. The antennas A_(a) 14A and A_(b) 14B convert incoming radio frequency (RF) signals from an airwave to a conducted form. The analog circuits G_(a) 24A and G_(b) 24B filter, amplify, and downconvert the conducted RF signals to a lower frequency. The analog circuits G_(a) 24A and G_(b) 24B also provide automatic gain control (AGC) for the signals. The A/D_(a) 26A and A/D_(b) 26B convert the lower frequency signals from an analog form to a digital form. The digital circuits g_(a) 28A and g_(b) 28B apply further filtering, amplification, frequency conversion, and AGC to the digitized signals and issue sampled receiver chain signals r_(n,a) and r_(n,b) where n is the index of the nth signal symbols received in the receiver chains 12A and 12B, respectively. The antenna A_(b) 14A has a different spatial location than the antenna A_(b) 14B, thereby providing spatial diversity.

[0043] Referring to FIG. 2, the receiver 10 receives a signal 30 from a transmitter 31 through a signal transmission channel A, denoted by 32A; and a signal transmission channel B, denoted by 32B, to antennas A_(b) 14A and A_(b) 14B, respectively. Because antennas A_(b) 14A and A_(b) 14B are physically separated, the signal transmission channels A 32A and B 32B are different and in general have different multipath. For temporal diversity, the transmitter 31 interleaves information bits into time-separated packets according to a system specification. The transmitter 31 also encodes and frames the information bits with an error detection/correction algorithm into packets. The encoded interleaved framed packets of transmitted bits are carried on the signal 30.

[0044] Returning to FIG. 1, the receiver 10 also includes a summer 34, a timing recovery circuit 36, a noise comparator 37, a diversity processor 38, and a postprocessor 39. The diversity processor 38 weights, combines and equalizes the receiver chain signals r_(n,a) and r_(n,b) by determining effective equalizer branch metrics according to the equation 1 or the equation 10.

[0045] The diversity processor 38 preferably includes a noise-based spatial diversity combiner 40 and a noise postscaler 41. The spatial diversity combiner 40 includes a noise prescaler 42A, a noise prescaler 42B, and an equalizer 43. The noise prescaler 42A can also be considered a part of the receiver chain 12A and similarly the noise prescaler 42B can be considered a part of the receiver chain 12B.

[0046] The receiver chain 12A also includes a channel estimator 44A, a squarer 45A, a noise estimator 46A, and buffers 48A and 49A. Similarly, the receiver chain 12B includes a channel estimator 44B, a squarer 45B, a noise estimator 46B, and buffers 48B and 49B. For the purpose of the present invention, there is no significant difference whether the analog circuits G_(a),G_(b) 24A,B, the analog-to-digital converters A/D_(a),A/D_(b) 26A,B, the digital circuits g_(a),g_(b) 28A,B, and the channel estimators 44A,B, the squarers 45A,B, and the noise estimators 46A,B are constructed separately for the receiver chains 12A,12B; or are constructed so as to span the receiver chains A,B 12A,12B.

[0047] The noise estimator 46A determines a representation p_(a) of the noise variance for the noise, including signal interference, for the receiver chain signal from the digital circuit g_(a) 28A and passes the noise representation p_(a) to the noise comparator 37. Similarly, the noise estimator 46B determines a representation p_(b) of the noise variance for the noise, including signal interference, for the receiver chain signal from the digital circuit g_(b) 28B and passes the noise representation p_(b) to the noise comparator 37. It is not necessary that the noise representations p_(a) and p_(b) be actual noise variances but only that they each have a relationship or ratio that can be directly to the actual noise variance ratio. The noise comparator 37 determines the smallest of the noise representations p_(a) and p_(b) as a minimum noise representation p_(min), and then computes a noise-based scale factor p_(min)/p_(a) for the receiver chain 12A and a noise-based scale factor p_(min)/p_(b) for the receiver chain 12B.

[0048] The channel estimators 44A and 44B use a training sequence embedded in the frames of the receiver chain signals from the digital circuits g_(a) 28A and g_(b) 28B, respectively, for estimating channel impulse response sets h_(k,a) and h_(k,b), respectively. The squarers 45A and 45B square absolute values of the channel impulse responses h_(k,a) and h_(k,b) and issue squared outputs H_(a) and H_(b) to the summer 34. The summer 34 adds the squared channel impulse responses H_(a) and H_(b) and then issues summed squared channel impulse responses to the timing recovery circuit 36. The timing recovery circuit 36 uses the summed squared channel impulse responses for providing a symbol synchronization index. The buffers 48A and 48B use the symbol synchronization index for buffering the receiver chain signals r_(n,a) and r_(n,b), respectively. The buffers 49A and 49B synchronize the channel impulse response sets h_(k,a) and h_(k,b), respectively.

[0049] The noise comparator 37 passes the scale factors p_(min)/p_(a) and p_(min)/p_(b) to the noise prescalers 42A and 42B, respectively. The noise prescaler 42A includes a signal prescaler 52A and a transmission channel prescaler 54A. The signal prescaler 52A multiplies the buffered received signal samples r_(n,a) by p_(min)/p_(a) for providing a prescaled receiver chain signal {tilde over (r)}_(n,a) as shown in the equation 3A. The transmission channel prescaler 54A multiplies the buffered channel impulse response set h_(k,a) by p_(min)/p_(a) for providing a prescaled channel impulse response set {tilde over (h)}_(k,a) as shown in the equation 4A. Similarly, the noise prescaler 42B includes a signal prescaler 52B and a transmission channel prescaler 54B. The signal prescaler 52B multiplies the buffered receiver chain signal r_(n,b) by p_(min)/p_(b) for providing a prescaled receiver chain signal {tilde over (r)}_(n,b) as shown in the equation 3B. The transmission channel prescaler 54B multiplies the buffered channel impulse response set h_(k,b) by p_(min)/p_(b) for providing a prescaled channel impulse response set {tilde over (h)}_(k,b) as shown in the equation 4B. The noise postscaler 41 uses a scale factor of 1/p² _(min) received from the noise comparator 37 for dynamically scaling the composite equalized signal ũ_(i).

[0050]FIG. 3 is a block diagram of the receiver 10 showing the receiver chains 12A and 12B through to a receiver chain 12M for providing signals to the noise prescalers 42A and 42B through to a noise prescaler 42M. The noise prescalers 42A-M pass signals to the equalizer 43 as described above. The receiver chain 12M is similar in all respects to the receiver chains 12A and 12B, and the noise prescaler 42M is similar in all respects to the noise prescalers 42A and 42B, described above. The receiver 10 may have many receiver chains 12A-M for spatial diversity or spatial and temporal diversity, or only one receiver chain 12A for temporal diversity but not spatial diversity. The receiver chains 12A, 12B through 12M provide squared channel impulse responses H_(a), H_(b) through H_(m) to the summer 34 and receive the index from the timing recovery circuit 36. The noise prescalers 42A-M receiver prescale scale factors from the noise comparator 37. The equalizer 43 is preferably a soft equalizer for providing bit probabilities as opposed to a hard equalizer where the actual bits are estimated.

[0051] The equalizer 43 includes functional blocks for a branch metric calculator 62, a combiner 64, and a probability calculator 66 preferably implemented together in a digital signal processor (DSP) integrated circuit where the DSP circuit is constructed as a single physical block. Because the DSP circuit is constructed as a single block it may not be possible to separate the functional blocks physically.

[0052] The branch metric calculator 62 uses prescaled channel impulse response sets {tilde over (h)}_(k,a), {tilde over (h)}_(k,b) through {tilde over (h)}_(k,m) for equalizing prescaled receiver chain signals {tilde over (r)}_(n,a), {tilde over (r)}_(n,b) through {tilde over (r)}_(n,m) for providing respective noise weighted terms of equalizer branch metrics for the receiver chains 12A, 12B through 12M, respectively. The combiner 64 adds the noise weighted terms for providing the composite equalizer branch metrics {tilde over (t)}_(n)(s→s′) as shown in the equation 5. The probability calculator 66 uses the composite equalizer branch metrics {tilde over (t)}_(n)(s→s′) for providing the composite equalized probability signal ũ_(i) as shown in the equation 6. Technical information for determining an equalized probability signal from equalizer branch metrics is shown by Gordon L. Stuber in “Principles of Mobile Communication, Second Edition” published 2001 by Kluwer Academic Publishers on pages 329-335, and by Gerhard Branch and Volker Franz in “A Comparison of Soft-In/Soft-Out Algorithms for “Turbo-Detection” published in the Proceedings of the International Conference on Telecommunications, ICT-98, on pages 259-263 in June, 1998. In a preferred implementation using a DSP integrated circuit the composite branch metrics {tilde over (t)}_(n)(s→s′) are intermediate results that are used in the equalizer 43 but are not necessarily available outside the equalizer 43.

[0053] The post processor 39 includes a deinterleaver 74 and a decoder 76. The noise postscaler 41 issues the postscaled composite equalized probability signal to the deinterleaver 74. The deinterleaver 74 reverses the interleaving of the system specification for placing the samples back into the order that they would have had without the interleaving performed by the transmitter 31 and passes a deinterleaved signal to the decoder 76. The decoder 76 uses a decoding algorithm according to a system specification for detecting and correcting errors in the deinterleaved signal in order to recover information bits. The information bits may receive further higher level processing in order to pass information for an application to its intended user.

[0054] The receiver 10 has been described in a detailed embodiment using prescale noise-based scale factors of p_(min)/p_(a), p_(min)/p_(b) through p_(min)/p_(m), and a postscale noise-based scale factor of 1/p² _(min) as shown in the equations 3A-C, 4A-C, 5, and 6. In an alternative embodiment, a receiver 110 of the present invention uses prescale noise-based scale factors of product(p_({overscore (a)})/p_(max)), product(p_({overscore (b)})/p_(max)) through product(p_({overscore (m)}))/p_(max), and a postscale noise-based scale factor of p_(max) ^(2(M−1))/p_(a) ²p_(b) ² . . . p_(m) ² as shown in the equations 8A-C, 9A-C and 10.

[0055] In the receiver 110 a noise comparator 137 receives the noise representation p_(a) from the noise estimator 46A, the noise representation p_(b) from the noise estimator 46B, and determines the largest of the noise representations p_(a), p_(b) as a maximum noise p_(max) and then computes the scale factor p_(b)/p_(max) for the receiver chain 12A and the scale factor as p_(a)/p_(max) for the receiver chain 12B. The noise comparator 137 passes the scale factor p_(b)/p_(max) to the noise prescaler 42A, passes the p_(a)/p_(max) to the noise prescaler 42B, and passes the scale factor p_(max) ^(2(M−1))/p_(a) ²p_(b) ² . . . p_(m) ² to the noise postscaler 41.

[0056] For two receiver chains 12A and 12B the noise prescaler 42A uses the scale factor p_(b)/p_(max) for prescaling the buffered receiver chain signal r_(n,a) for providing a prescaled receiver chain signal {tilde over (r)}″_(n,a) as shown in the equation 8A and prescaling the buffered channel impulse response set h_(k,a) for providing a prescaled channel impulse response set {tilde over (h)}″_(k,a) as shown in the equation 9A; similarly, the noise prescaler 42B uses the scale factor p_(a)/p_(max) for prescaling the buffered receiver chain signal r_(n,b) for providing a prescaled receiver chain signal {tilde over (r)}″_(n,b) as shown in the equation 8B and prescaling the buffered channel impulse response set h_(k,b) for providing a prescaled channel impulse response set {tilde over (h)}″_(k,b) as shown in the equation 9B. The branch metric calculator 62 of the equalizer 43 uses the prescaled channel impulse response set {tilde over (h)}″_(k,a), {tilde over (h)}″_(k,b) through {tilde over (h)}″_(k,m) for equalizing the prescaled receiver chain signals {tilde over (r)}″_(n,a), {tilde over (r)}″_(n,b) through {tilde over (r)}″_(n,m) and the combiner 64 adds the terms for issuing values of composite branch metrics as shown in the equation 10. The probability calculator 66 uses the composite equalizer branch metrics {tilde over (t)}_(n)″(s→s′) for providing the composite equalized probability signal ũ″_(i) analogous to the composite equalized signal ũ_(i) shown in the equation 6.

[0057]FIG. 4 is a block diagram of the noise estimator 46A of the present invention for the receiver chain 12A where the receiver 10,110 is a Global Systems for Mobile Communications (GSM) cellphone receiver. The GSM system specifies a 26-symbol training sequence of the form w₁₁, w₁₂, w₁₃, w₁₄, w₁₅, w₀, w₁, w₂, w₃, w₄, w₅, w₆, w₇, w₈, w₉, w₁₀, w₁₁, w₁₂, w₁₃, w₁₄, w₁₅, w₀, w₁, w₂, w₃, w₄. The noise estimator 46A uses the GSM training sequence in real and imaginary cyclic finite impulse response (FIR) filters for providing the noise representation p_(a) as shown in the equation 11. Block diagrams for the noise estimator 46B for the receiver chain 12B or for additional noise estimators for additional receiver chains 12B through 12M are the same.

[0058] The noise estimator 46A includes a cyclic inter-symbol interference (ISI) sequence generator 102 implemented with shift registers, a convolver implemented with real and imaginary convolvers 104I and 104Q, a comparator implemented with real and imaginary signal comparators 106I and 106Q, and a linear noise combiner 108. The ISI sequence generator 102 shifts and recycles the sixteen central symbols w₀ through w₁₅ of the 26-symbol GSM training sequence that are known according to the GSM system specification.

[0059] The 26-symbol GSM training sequence includes a pre-pended section of five symbols w₁₁ through w₁₅ followed by a center section of sixteen symbols w₀ through w₁₅ followed by five post-pended section of five symbols w₀ to w₄. The pre-pended five symbol section is a duplicate of the last five symbols (w₁₁ to w₁₅) of the center sixteen symbol section and the post-pended five symbol section is a duplicate of the first five symbols (w₀ to w₄) of the center sixteen symbol section. The convolver 104I is shown for an impulse response set of six coefficients h_(0,a) to h_(5,a). Other numbers of coefficients may be used. At the start, the receiver chain signal r_(n+ξ,a)=r_(ξ,a) for the index n=0 is synchronized with the w₀ as shown at the start of the ISI sequence generator 102.

[0060] The convolver 104I includes multipliers 112I and a convolution summer 114I. For the index n=0, the multipliers 112I multiply the first six symbols w₀, w₁₅ through w₁₁ in the generator 102 by the six impulse response coefficients h_(0,a), h_(1,a) through h_(5,a), respectively, for providing six products. The six products are added in the convolution summer 114I and the convolution result of the real n=0 channel dispersed training symbol is passed to the signal comparator 106I. The signal comparator 106I determines a difference between the n=0 channel dispersed training symbol and the receiver chain symbol r_(ξ,a) and determines the absolute value of the difference as a real symbol noise amplitude for the first training symbol. The real first symbol noise amplitude is passed to the linear noise combiner 108. It should be noted that the real symbol noise amplitude is an absolute value.

[0061] This is repeated for the indexes n equal to 1 through 15 while the ISI sequence generator 102 cycles at the same rate, and the results are passed to the linear noise combiner 108. For example, for the next index (n=1) the generator 102 is cycled so that its first symbol is w₁, its second symbol is w₀, and so on so that its fifteenth symbol is w₂. The multipliers 112I multiply the first six symbols w₁, w₀ through w₁₂ in the generator 102 by the six impulse response coefficients h_(0,a), h_(1,a) through h_(5,a), respectively, for providing six new products. The six new products are added in convolution summer 114I and the real n=1 channel dispersed training symbol is passed to the signal comparator 106I. The signal comparator 106I subtracts the n=1 channel dispersed training symbol from the receiver chain symbol r_(ξ+1,a) and passes the absolute value of the difference as a real second symbol noise amplitude to the linear noise combiner 108.

[0062] The linear noise combiner 108 includes real and imaginary accumulators 122I and 122Q and a real imaginary adder 124. The accumulator 122I receives the real symbol noise amplitudes. When the accumulator 122I has accumulated the real symbol noise amplitudes for n from 0 to 15, it passes the accumulated result to the adder 124. The imaginary convolver 104Q, the imaginary signal comparator 106Q, and the imaginary accumulator 122Q operate in an identical manner.

[0063] The adder 124 adds the accumulated results from the real and imaginary accumulators 122I and 122Q for providing the noise representation p_(a) as shown in the equation 11. In an equivalent alternative block diagram, the real and imaginary symbol noise amplitudes are added and then the sum is accumulated for providing the noise representation p_(a). It should be noted that the averaging shown in the equation 11 is equivalent to adding all the real and imaginary symbol noise absolute amplitudes divided by the number of symbols, sixteen in the above description, that were used in the addition. It should also be noted that the noise representation p_(a) is determined without any requirement for squaring the real and imaginary noise components or for taking a square root of any combination of real and imaginary noise components.

[0064]FIG. 5 is a flow chart of a method in the receiver 10,110 for diversity processing of the incoming signal 30. In a step 202 the receiver 10,110 receives the signal 30 and provides receiver chain signals. In a step 210 noise representations for noise levels of the receiver chain signals are determined. There is a noise representation for the receiver chain signal for each receiver chain, respectively. In a step 212 the noise-based scale factors for each of the receiver chain signals are calculated from the noise representations. Then, in a step 220 the scale factors are used for effectively weighting equalizer branch metrics that represent the receiver chain signals in order to determine the composite equalized signal. In a step 224, for temporal diversity, the composite equalized signal is deinterleaved. Then, in a step 226 the deinterleaved composite equalized signal is decoded for providing a best estimate of the information bits that were transmitted by the transmitter 31 and carried in the form of coded, interleaved symbols modulated onto the signal 30.

[0065]FIG. 6 is a flow chart of a preferred embodiment for the step 220 for determining the composite equalized signal. In a step 232 the channel impulse response coefficients are determined for the receiver chain signal for the receiver chains 12A-M, respectively. There is a set of channel impulse response coefficients for each receiver chain signal, respectively. In a step 234 the channel impulse response coefficients for each of the receiver chain signals are prescaled with the prescale factor for that receiver chain signal. In a step 242 the receiver chain signals are prescaled with the respective prescale factors. In a step 250 the prescaled receiver chain signals are equalized with the prescaled channel impulse response coefficients for determining a composite equalized signal. Where temporal diversity is used, the composite equalized signal is a preliminary composite equalized signal. In a step 260, for temporal diversity the preliminary composite equalizer signal is postscaled with the postscale factor for providing the composite equalizer signal.

[0066] The step 250 for equalizing the receiver chain signals functionally includes steps 262, 264, and 266. In the step 262 prescaled equalizer branch metrics are determined from the prescaled receiver chain signals and the prescaled channel impulse response coefficients. In the step 262, for spatial diversity, the prescaled equalizer branch metrics for the receiver chains 12A-M are combined for providing the composite equalizer branch metrics. In the step 266 the composite equalizer branch metrics are processed for determining the composite equalized signal. It should be emphasized that the steps 262-266 are functional operations that may be performed in various ways by digital signal processing techniques where the functions may or may not be physically separable.

[0067]FIG. 7 is a flow chart of a preferred embodiment for the step 210 for determining the noise representations. In the step 232 the channel impulse response coefficients are determined for the receiver chain signals for the receiver chains 12A-M, respectively. In a step 272 a stored replica sequence of predetermined training symbols are continuously shifted and the replica symbols of the shifting sequence are issued in parallel. For the example of GSM the training symbols are shifted in as a circulating cycle. However, the symbols could be shifted in different ways for different system specifications. Real shifting replica symbols are convolved with real channel impulse response coefficients in a step 274; and imaginary shifting replica symbols are convolved with imaginary channel impulse response coefficients in a step 275 for providing real and imaginary channel dispersed replica symbols. In a step 276 real symbols noise amplitudes are determined from the absolute values of the differences between the real dispersed replica symbols and the real symbols in the corresponding receiver chain signals. In a step 277 imaginary symbols noise amplitudes are determined from the absolute values of the differences between the imaginary channel dispersed replica symbols and the imaginary symbols in the corresponding receiver chain signals. Each symbol in a receiver chain signal has an unsigned real noise value and an unsigned imaginary noise. In a step 280 the real and imaginary symbol noise values for a receiver chain signal are accumulated over a certain number of symbols for determining the noise representations for that receiver chain signal.

[0068] Although the present invention has been described in terms of the presently preferred embodiments, it is to be understood that such disclosure is not to be interpreted as limiting. Various alterations and modifications will no doubt become apparent to those skilled in the art after having read the above disclosure. Accordingly, it is intended that the appended claims be interpreted as covering all alterations and modifications as fall within the true spirit and scope of the invention. 

What is claimed is:
 1. A receiver for receiving an incoming signal having spatial diversity, comprising: two or more receiver chains for receiving said incoming signal and providing two or more receiver chain signals, respectively; the receiver chains including noise estimators for determining noise representations from said receiver chain signals, respectively, said noise representations representative of noise levels; a noise comparator for determining noise-based scale factors from said noise representations; and a noise-based spatial diversity combiner using said scale factors for weighting representations of said receiver chain signals for providing a composite equalized signal.
 2. The receiver of claim 1, wherein: the noise-based spatial diversity combiner includes an equalizer for determining said composite equalized signal based upon a sum of weighted equalizer branch metrics corresponding to said receiver chain signals, respectively, said weighted equalizer branch metrics having weightings corresponding to said noise-based scale factors.
 3. The receiver of claim 1, wherein: said noise-based scale factors include two or more prescale factors corresponding to said two or more receiver chain signals, respectively; and the spatial diversity combiner includes two or more noise prescalers for pre-scaling said receiver chain signals with said corresponding prescale factors for providing prescaled receiver chain signals, respectively; and an equalizer for equalizing said prescaled receiver chain signals for providing said composite equalized signal.
 4. The receiver of claim 3, wherein: the receiver chains further include channel estimators for determining two or more sets of channel impulse response coefficients corresponding to said two or more receiver chain signals, respectively; the noise prescalers include transmission channel prescalers, respectively, for prescaling said channel impulse response coefficients with said corresponding prescale factors for providing corresponding prescaled channel impulse response coefficients; and the equalizer equalizes said prescaled receiver chain signals using said corresponding prescaled channel impulse response coefficients and provides said composite equalized signal.
 5. The receiver of claim 4, wherein: an ath one of said transmission channel prescalers prescales an ath set of said channel impulse response coefficients according to: {tilde over (h)} _(k,a)=(p _(min) /p _(a))h _(k,a)  where the h_(k,a) represents a kth coefficient of said ath set of said channel impulse response coefficients corresponding to an ath one of said receiver chain signals, the p_(a) represents an ath one of said noise representations corresponding to said ath receiver chain signal, the p_(min) represents the smallest of said noise representations for all said receiver chain signals, and the {tilde over (h)}_(k,a) represents said kth coefficient of an ath set of said prescaled channel impulse response coefficients.
 6. The receiver of claim 4, wherein: an ath one of said transmission channel prescalers prescales an ath set of said channel impulse response coefficients according to: {tilde over (h)}″ _(k,a)=product(p _({overscore (a)}) /p _(max))h _(k,a)  where the h_(k,a) represents a kth coefficient of said ath set of said channel impulse response coefficients corresponding to an ath one of said receiver chain signals, the p_(max) represents the largest of said noise representations for all said receiver chain signals, the product(p_({overscore (a)})/p_(max)) represents the product of said noise representations of all said receiver chain signals divided by the p_(max) except said noise representation corresponding to said ath receiver chain signal, and the {tilde over (h)}″_(k,a) represents said kth coefficient of an ath set of said prescaled channel impulse response coefficients.
 7. The receiver of claim 3, wherein: a first of said prescale factors corresponding to a first of said receiver chains depends inversely upon a first of said noise representations corresponding to said first receiver chain signal.
 8. The receiver of claim 7, wherein: the noise comparator determines a smallest of said noise representations; and said first prescale factor depends directly upon said smallest noise representation.
 9. The receiver of claim 7, wherein: an ath one of said noise prescalers prescales an ath one of said receiver chain signals according to: {tilde over (r)} _(n,a)=(p _(min) /p _(a))r _(n,a)  where the r_(n,a) represents an nth received symbol in said ath receiver chain signal, the p_(a) represents an ath one of said noise representations corresponding to said ath receiver chain signal, the p_(min) represents the smallest of said noise representations for all said receiver chain signals, and the {tilde over (r)}_(n,a) represents said nth received symbol of an ath one of said prescaled receiver chain signals corresponding to said ath receiver chain signal.
 10. The receiver of claim 3, wherein: a first of said prescale factors corresponding to a first of said receiver chains depends directly upon a product of all said noise representations except a first of said noise representations, said first noise representation corresponding to said first receiver chain signal.
 11. The receiver of claim 10, wherein: the noise comparator determines a largest one of said noise representations; and said first prescale factor depends inversely upon said largest noise representation.
 12. The receiver of claim 3, wherein: an ath one of said noise prescalers prescales an ath one of said receiver chain signals according to: {tilde over (r)}″ _(n,a)=product(p _({overscore (a)}) /p _(max))r _(n,a)  where the r_(n,a) represents an nth received symbol in said ath receiver chain signal, the p_(max) represents the largest of said noise representations for all said receiver chain signals, the product(p_({overscore (a)})/p_(max)) represents the product of said noise representations of all said receiver chain signals divided by the p_(max) except said noise representation corresponding to said ath receiver chain signal, and the {tilde over (r)}″_(n,a) represents said nth received symbol of an ath one of said prescaled receiver chain signals corresponding to said ath receiver chain signal.
 13. The receiver of claim 1, wherein: said noise-based scale factors include a postscale factor dependent inversely on a square of a smallest of said noise representations; and further comprising: a postscaler for post-scaling said composite equalized signal by said postscale factor.
 14. The receiver of claim 1, wherein: said noise-based scale factors include a postscale factor dependent directly on a square of a largest of said noise representations; and further comprising: a postscaler for post-scaling said composite equalized signal by said postscale factor.
 15. A receiver for receiving an incoming signal having diversity, comprising: two or more receiver chains for receiving said incoming signal and providing two or more receiver chain signals, respectively, the receiver chains including noise estimators for determining noise representations from said receiver chain signals, respectively, said noise representations representative of noise levels; and a diversity processor for determining a composite equalized signal based upon a composite of weighted equalizer branch metrics representative of said receiver chain signals, respectively, having weightings calculated from said noise representations, said composite equalized signal used for computing information bits carried in said incoming signal.
 16. The receiver of claim 15, wherein: the diversity processor bases said composite equalized signal upon said composite equalizer branch metrics according to: ${t_{n}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{b}^{2}}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{m}^{2}}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}$

 where the r_(n,a), r_(n,b) through r_(n,m) represent nth received symbols received in ath, bth through mth of said receiver chain signals, respectively; the h_(0,a), h_(0,b) through h_(0,m) represent 0th channel impulse response coefficients for said ath, bth through mth receiver chain signals; the h_(k,a), h_(k,b) through h_(k,m) represent kth of 1 to K channel impulse response coefficients for said ath, bth through mth receiver chain signals; the x_(n)(s→s′) represents symbols uniquely determined by an equalizer transition from an originating state s to a new state s′ for said nth symbols; the x_(n−k)(s) represents symbols uniquely determined by said state s for said nth symbols and said kth of 1 to said K coefficients; the p_(a) ², p_(b) ² through p_(m) ² are squares of said noise representations for said ath, bth through mth receiver chain signals, respectively; and the t_(n)(s→s′) represents said composite equalizer branch metrics corresponding to said equalizer transitions for said nth symbols, said composite equalizer branch metrics used for determining said information bits.
 17. The receiver of claim 15, wherein: the diversity processor bases said composite equalized signal upon said composite equalizer branch metrics according to: ${{\overset{\sim}{t}}_{n}^{''}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{a}} \right)}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{b}} \right)}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{m}} \right)}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}$

 where the r_(n,a), r_(n,b) through r_(n,m) represent nth received symbols received in ath, bth through mth of said receiver chains, respectively; the h_(0,a), h_(0,b) through h_(0,m) represent 0th channel impulse response coefficients for said ath, bth through mth receiver chain signals; the h_(k,a), h_(k,b) through h_(k,m) represent kth of 1 to K channel impulse response coefficients for said ath, bth through mth receiver chains; the x_(n)(s→s′) represent symbols uniquely determined by an equalizer transition from an originating state s to a new state s′ for said nth symbols; the x_(n−k)(s) represents symbols uniquely determined by said state s for said nth symbols and said kth of 1 to said K coefficients; the p_(a) ², p_(b) ² through p_(m) ² are squares of said noise representations for said ath, bth through mth receiver chains, respectively; the product(p_({overscore (a)})), product(p_({overscore (b)})) through product(p_({overscore (m)})) are products of all said noise representations except said noise representations for said ath, bth through mth receiver chains, respectively; and the t_(n)(s→s′) represents said composite equalizer branch metrics corresponding to said equalizer transitions for said nth symbols, said composite equalizer branch metrics used for determining said information bits.
 18. A method for receiving an incoming signal having spatial diversity, comprising: receiving said incoming signal with two or more receiver chains for providing two or more receiver chain signals, respectively; determining noise representations for said receiver chain signals, respectively, said noise representations representative of noise levels; calculating noise-based scale factors from said noise representations; and determining a composite equalized signal by using said scale factors for weighting representations of said receiver chain signals.
 19. The method of claim 18, wherein: the step of determining a composite equalized signal includes determining said composite equalized signal based upon a sum of weighted equalizer branch metrics corresponding to said receiver chain signals, respectively, said weighted equalizer branch metrics having weightings corresponding to said noise-based scale factors.
 20. The method of claim 18, wherein: said noise-based scale factors include two or more noise prescale factors corresponding to said two or more receiver chain signals, respectively; and the step of determining a composite equalized signal includes steps of prescaling said receiver chain signals with said corresponding prescale factors for providing prescaled receiver chain signals, respectively; and equalizing said prescaled receiver chain signals for providing said composite equalized signal.
 21. The method of claim 20, wherein: the step of equalizing said prescaled receiver chain signals includes determining two or more sets of channel impulse response coefficients from said two or more receiver chain signals, respectively; prescaling said channel impulse response coefficients with the corresponding prescale factors for providing corresponding prescaled channel impulse response coefficients; and equalizing said prescaled receiver chain signals with said corresponding prescaled channel impulse response coefficients for providing said composite equalized signal.
 22. The method of claim 21, wherein: the step of prescaling said channel impulse response coefficients includes prescaling an ath set of said channel impulse response coefficients according to: {tilde over (h)} _(k,a)=(p _(min) /p _(a))h _(k,a)  where the h_(k,a) represents a kth coefficient of said ath set of said channel impulse response coefficients corresponding to an ath one of said receiver chain signals, the p_(a) represents an ath one of said noise representations corresponding to said ath receiver chain signal, the p_(min) represents the smallest of said noise representations for all said receiver chain signals, and the {tilde over (h)}_(k,a) represents said kth coefficient of an ath set of said prescaled channel impulse response coefficients.
 23. The method of claim 21, wherein: the step of prescaling said channel impulse response coefficients includes prescaling an ath set of said channel impulse response coefficients according to: {tilde over (h)}″ _(k,a)=product(p _({overscore (a)}) /p _(max))h _(k,a)  where the h_(k,a) represents a kth coefficient of said ath set of said channel impulse response coefficients corresponding to an ath one of said receiver chain signals, the p_(max) represents the largest of said noise representations for all said receiver chain signals, the product(p_({overscore (a)})/p_(max)) represents the product of said noise representations of all said receiver chain signals divided by the p_(max) except said noise representation corresponding to said ath receiver chain signal, and the {tilde over (h)}″_(k,a) represents said kth coefficient of an ath set of said prescaled channel impulse response coefficients.
 24. The method of claim 20, wherein: a first of said prescale factors corresponding to a first of said receiver chain signals depends inversely upon a first of said noise representations corresponding to said first receiver chain signal.
 25. The method of claim 24, further comprising: determining a smallest of said noise representations; and wherein: said first prescale factor depends directly upon said smallest noise representation.
 26. The method of claim 24, wherein: an ath one of said noise prescalers prescales an ath one of said receiver chain signals according to: {tilde over (r)} _(n,a)=(p _(min) /p _(a))r _(n,a)  where the r_(n,a) represents an nth received symbol in said ath receiver chain signal, the p_(a) represents an ath one of said noise representations corresponding to said ath receiver chain signal, the p_(min) represents the smallest of said noise representations for all said receiver chain signals, and the {tilde over (r)}_(n,a) represents said nth received symbol of an ath one of said prescaled receiver chain signals corresponding to said ath receiver chain signal.
 27. The method of claim 20, wherein: a first of said prescale factors corresponding to a first of said receiver chain signals depends directly upon a product of all of said noise representations except a first of said noise representations, said first noise representation corresponding to said first receiver chain signal.
 28. The method of claim 27, further comprising: determining a largest of said noise representations; and wherein: said first prescale factor depends inversely upon said largest noise representation.
 29. The method of claim 28, wherein: an ath one of said noise prescalers prescales an ath one of said receiver chain signals according to: {tilde over (r)}″ _(n,a)=product(p _({overscore (a)}) /p _(max))r _(n,a)  where the r_(n,a) represents an nth received symbol in said ath receiver chain signal, the p_(max) represents the largest of said noise representations for all said receiver chain signals, the product(p_({overscore (a)})/p_(max)) represents the product of said noise representations of all said receiver chain signals divided by the p_(max) except said noise representation corresponding to said ath receiver chain signal, and the {tilde over (r)}″_(n,a) represents said nth received symbol of an ath one of said prescaled receiver chain signals corresponding to said ath receiver chain signal.
 30. The method of claim 18, wherein: said noise-based scale factors include a postscale factor dependent inversely on a square of a smallest of said noise representations; and further comprising: post-scaling said composite equalized signal by said postscale factor.
 31. The method of claim 18, wherein: said noise-based scale factors include a postscale factor dependent directly on a square of a largest of said noise representations; and further comprising: post-scaling said composite equalized signal by said postscale factor.
 32. A method for receiving an incoming signal having diversity, comprising: receiving said incoming signal and providing two or more receiver chain signals; determining noise representations from said receiver chain signals, respectively, said noise representations representative of noise levels; and determining a composite equalized signal based upon a composite of weighted equalizer branch metrics representative of said receiver chain signals, respectively, having weightings calculated from said noise representations, said composite equalized signal used for computing information bits carried in said incoming signal.
 33. The method of claim 32, wherein: the step of determining said composite equalized signal includes determining said composite equalized signal based upon said composite equalizer branch metrics according to: ${t_{n}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{b}^{2}}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{m}^{2}}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}$

 where the r_(n,a), r_(n,b) through r_(n,m) represent nth received symbols received in ath, bth through mth of said receiver chain signals, respectively; the h_(0,a), h_(0,b) through h_(0,m) represent 0th channel impulse response coefficients for said ath, bth through mth receiver chain signals; the h_(k,a), h_(k,b) through h_(k,m) represent kth of 1 to K channel impulse response coefficients for said ath, bth through mth receiver chain signals; the x_(n)(s→s′) represents symbols uniquely determined by an equalizer transition from an originating state s to a new state s′ for said nth symbols; the x_(n−k)(s) represents symbols uniquely determined by said state s for said nth symbols and said kth of 1 to said K coefficients; the p_(a) ², p_(b) ² through p_(m) ² are squares of said noise representations for said ath, bth through mth receiver chain signals, respectively; and the t_(n)(s→s′) represents said composite equalizer branch metrics corresponding to said equalizer transitions for said nth symbols, said composite equalizer branch metrics used for determining said information bits.
 34. The method of claim 32, wherein: the step of determining said composite equalized signal includes determining said composite equalized signal based upon said composite equalizer branch metrics according to: ${{\overset{\sim}{t}}_{n}^{''}\left( {s->s^{\prime}} \right)} = {{\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{a}} \right)}{{r_{n,a} - {h_{o,a}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,a}{x_{n - k}(s)}}}}}^{2}} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{b}} \right)}{{r_{n,b} - {h_{o,b}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,b}{x_{n - k}(s)}}}}}^{2}\quad \ldots} + {\frac{1}{p_{a}^{2}p_{b}^{2}\quad \ldots \quad p_{m}^{2}}{{product}\left( {p\frac{2}{m}} \right)}{{r_{n,m} - {h_{o,m}{x_{n}\left( {s->s^{\prime}} \right)}} - {\sum\limits_{k = 1}^{K}{h_{k,m}{x_{n - k}(s)}}}}}^{2}}}$

 where the r_(n,a), r_(n,b) through r_(n,m) represent nth received symbols received in ath, bth through mth of said receiver chains, respectively; the h_(0,a), h_(0,b) through h_(0,m) represent 0th channel impulse response coefficients for said ath, bth through mth receiver chain signals; the h_(k,a), h_(k,b) through h_(k,m) represent kth of 0 to K channel impulse response coefficients for said ath, bth through mth receiver chains; the x_(n)(s→s′) represent symbols uniquely determined by an equalizer transition from an originating state s to a new state s′ for said nth symbols; the x_(n−k)(s) represents symbols uniquely determined by said state s for said nth symbols and said kth of 1 to said K coefficients; the p_(a) ², p_(b) ² through p_(m) ² are squares of said noise representations for said ath, bth through mth receiver chains, respectively; the product(p_({overscore (a)})), product(p_({overscore (b)})) through product(p_({overscore (m)})) are products of all said noise representations except said noise representations for said ath, bth through mth receiver chains, respectively; and the t_(n)(s→s′) represents said composite equalizer branch metrics corresponding to said equalizer transitions for said nth symbols, said composite equalizer branch metrics used for determining said information bits. 